An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint
نویسنده
چکیده
Historically, discrete minimization problems in constrained logical programming were modeled with the help of an isolated bounding constraint on the objective that is to be decreased. To overcome this frequently inefficient way of searching for improving solutions, the notion of optimization constraints was introduced. Optimization constraints can be viewed as global constraints that link the objective with other constraints of the problem at hand. We present an arcconsistency (actually: hyper-arc-consistency) algorithm for the minimum weight all different constraint which is an optimization constraint that consists in the combination of a linear objective with an all different constraint.
منابع مشابه
A Hyper-arc Consistency Algorithm for the Soft Alldifferent Constraint
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flow problem. Consistency of the constraint can be checked in O(nm) time, and hyper-arc consistency is achieved in O(m) time, where n is the number of variables involved and m is the sum of the cardinalities of the domai...
متن کاملSimpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
The weighted spanning tree contraint is defined from a set of variables X and a value K. The variables X represent the nodes of a graph and the domain of a variable x ∈ X the neighbors of the node in the graph. In addition each pair (variable, value) is associated with a cost. This constraint states that the graph defined from the variables and the domains of the variables admits a spanning tre...
متن کاملOn Algorithms for Decomposable Constraints
Non-binary constraints are present in many real-world constraint satisfaction problems. Certain classes of these constraints, like the all-different constraint, are “decomposable”. That is, they can be represented by binary constraints on the same set of variables. For example, a non-binary all-different constraint can be decomposed into a clique of binary not-equals constraints. In this paper ...
متن کاملPeek arc consistency
This paper studies peek arc consistency, a reasoning technique that extends the wellknown arc consistency technique for constraint satisfaction. In contrast to other more costly extensions of arc consistency that have been studied in the literature, peek arc consistency requires only linear space and quadratic time and can be parallelized in a straightforward way such that it runs in linear tim...
متن کاملOptimal Design of Geometrically Nonlinear Structures Under a Stability Constraint
This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002